TAL: Temporal Action Logics Language Specification and Tutorial

Reformulating Temporal Action Logics in Answer Set Programming

Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergies it brings. First, the reformulation provides a means to compute TAL using efficient answer set solvers. Second, TAL provides a structured high-level language for ASP (possibly with constraint solving). Third, the re...

Implementing Temporal Logics: Tools for Execution and Proof (Tutorial Paper)

Temporal logic was originally developed in order to represent tense in natural language [36]. Within Computer Science, it has achieved a significant role in the formal specification and verification of concurrent and distributed systems [35]. Much of this popularity has been achieved as a number of useful concepts, such as safety, liveness and fairness can be formally, and concisely, specified ...

Action Languages, Temporal Action Logics and the Situation Calculus

In the rst part of the paper, we investigate the relationship between the action description language C and the situation calculus. Action description languages are based on the model of time that includes only two time instants: 0 for the beginning of the execution of an action and 1 for the end. The ontology of time in the situation calculus is much more elaborate. We show how to bridge the g...

Event calculus and temporal action logics compared

We compare the event calculus and temporal action logics (TAL), two formalisms for reasoning about action and change. We prove that, if the formalisms are restricted to integer time, inertial fluents, and relational fluents, and if TAL action type specifications are restricted to definite reassignment of a single fluent, then the formalisms are not equivalent. We argue that equivalence cannot b...

Tutorial notes on Introduction to Temporal Logics for Specification and Verification